Ergodicity of Queueing Networks with Several Customer Cl~sses and Arbitrary Work.conserving Scheduling
نویسنده
چکیده
We consider a network of service stations with different classes of customers where interarrival times and service requirments have ph~e-type distributions, and the service discipline is an arbitrary work-conserving policy. We show that the underlying Markov process is ergodic, if and only if the utilization at eaclt. service station is less than one. We also show, that all the moments of the queue lengths under-the stationary distribution, are finite.
منابع مشابه
Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The arrival and potential service processes and routing decisions at the queues are independent, stationary and ergodic. A scheduling policy is called robust if it...
متن کاملA Fluid Control Problem in Queueing Networks with General Service Times
We consider a queueing network with several customer classes and several service pools, each consisting of many statistically identical servers. The service requirement of each customer is assumed to be generally distributed and is allowed to depend on both the customer class and the service pool. Customers may also abandon while waiting in queue, with exponentially distributed patience time. F...
متن کاملQueueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules
In this paper, we study the stationary dynamics of a processing system comprised of several parallel queues and a single server of constant rate. The connectivity of the server to each queue is randomly modulated, taking values 1 (connected) or 0 (severed). At any given time, only the currently connected queues may receive service. A key issue is how to schedule the server on the connected queu...
متن کاملInstability Phenomena in Underloaded Packet Networks with QoS Schedulers
Instability in packet networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload generates instability. However, some results showing that instability can happen also in underloaded queueing networks appeared in the literature. Underload instabilities can be produced either by customer routes that visit several time...
متن کاملLinear loss networks
This paper investigates theoretical properties of throughput and cost in linear loss networks. The maximum throughput of the network with exponential service times is derived and the arrival process that maximizes throughput, given a fixed arrival rate, is established. For general service times, an asymptotically critical loading regime is identified such that the probability of an arbitrary cu...
متن کامل